A Combinatorial Theory of Higher-Dimensional Permutation Arrays

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Combinatorial Higher Dimensional Isoperimetry and Divergence

In this paper we provide a framework for the study of isoperimetric problems in finitely generated group, through a combinatorial study of universal covers of compact simplicial complexes. We show that, when estimating filling functions, one can restrict to simplicial spheres of particular shapes, called “round” and “unfolded”, provided that a bounded quasi-geodesic combing exists. We prove tha...

متن کامل

A Combinatorial Characterization of Higher-Dimensional Orthogonal Packing

Higher-dimensional orthogonal packing problems have a wide range of practical applications, including packing, cutting, and scheduling. Previous efforts for exact algorithms have been unable to avoid structural problems that appear for instances in twoor higher-dimensional space. We present a new approach for modeling packings, using a graph-theoretical characterization of feasible packings. Ou...

متن کامل

Constructions of permutation arrays

977 d 0 1 of the copies of C C C q , the inner product hvjMjvi is constant as v ranges over the unit vectors of C. A quantum code with minimum distance d can be used to correct [(d 0 1)=2] single-letter errors.

متن کامل

Towards Higher-dimensional Rewriting Theory

String rewriting systems have proved very useful to study monoids. In good cases, they give finite presentations of the monoids, allowing their manipulation by a computer. Even better, when the presentation is confluent and terminating, they provide one with a notion of canonical representative of the elements of the presented monoid. Polygraphs are a higher-dimensional generalization of this n...

متن کامل

Combinatorial Properties of Permutation Tableaux

Abstract. We give another construction of a permutation tableau from its corresponding permutation and construct a permutation-preserving bijection between 1-hinge and 0-hinge tableaux. We also consider certain alignment and crossing statistics on permutation tableaux that are known to be equidistributed via a complicated map to permutations that translates those to occurrences of certain patte...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Advances in Applied Mathematics

سال: 2000

ISSN: 0196-8858

DOI: 10.1006/aama.1999.0693